Scale-free Networks from Optimal Design

A large number of complex networks, both natural and artificial, share the presence of highly heterogeneous, scale-free degree distributions. A few mechanisms for the emergence of such patterns have been suggested, optimization not being one of them. In this letter we present the first evidence for the emergence of scaling (and smallworldness) in software architecture graphs from a well-defined local optimization process. Although the rules that define the strategies involved in software engineering should lead to a tree-like structure, the final net is scale-free, perhaps reflecting the presence of conflicting constraints unavoidable in a multidimensional optimization process. The consequences for other complex networks are outlined.Comment: 6 pages, 2 figures. Submitted to Europhysics Letters. Additional material is available at http://complex.upc.es/~sergi/software.ht

Exploring complex networks by walking on them

We carry out a comparative study on the problem for a walker searching on several typical complex networks. The search efficiency is evaluated for various strategies. Having no knowledge of the global properties of the underlying networks and the optimal path between any two given nodes, it is found that the best search strategy is the self-avoid random walk. The preferentially self-avoid random walk does not help in improving the search efficiency further. In return, topological information of the underlying networks may be drawn by comparing the results of the different search strategies.Comment: 5 pages, 5 figure

Topological reversibility and causality in feed-forward networks

Systems whose organization displays causal asymmetry constraints, from evolutionary trees to river basins or transport networks, can be often described in terms of directed paths (causal flows) on a discrete state space. Such a set of paths defines a feed-forward, acyclic network. A key problem associated with these systems involves characterizing their intrinsic degree of path reversibility: given an end node in the graph, what is the uncertainty of recovering the process backwards until the origin? Here we propose a novel concept, \textit{topological reversibility}, which rigorously weigths such uncertainty in path dependency quantified as the minimum amount of information required to successfully revert a causal path. Within the proposed framework we also analytically characterize limit cases for both topologically reversible and maximally entropic structures. The relevance of these measures within the context of evolutionary dynamics is highlighted.Comment: 9 pages, 3 figure

Minor and subthreshold depressive disorders in Alzheimer's disease: a systematic review and meta-analysis of prevalence studies

Background: Depressive symptoms are common in Alzheimer's disease (AD) and negatively impact patient well-being. The main aim of the present study was to establish summary estimates for the prevalence of minor depressive disorder (MinD) and subthreshold depression in AD and synthesise evidence on prognosis and management of these symptoms in order to inform clinical guidelines. / Methods: Systematic review and meta-analysis of cross-sectional and longitudinal studies of prevalence, prognosis, and treatments for minor and subthreshold depression in AD. We searched MEDLINE, Embase, PsycINFO and CINAHL. We included studies that reported prevalence of subthreshold depressive disorders and those reporting data on validity of diagnostic criteria, mechanisms, or randomised controlled clinical trials (RCTs) testing effectiveness of interventions. Estimates of prevalence were pooled using random-effects meta-analyses. Two authors screened articles and independently extracted data on study characteristics. / Results: We reviewed 5671 abstracts, retrieved 621 full text articles and included a total of 15 studies. Pooling data from 10 studies showed that prevalence for MinD in AD was 22.0% (95% CI 16.0 to 28.0). Prevalence for a clinical diagnosis of MinD (DSM-III-R and DSM-IV) was 26.0% (95% CI 20.0 to 32.0; 6 studies). People with MinD experienced higher levels of neuropsychiatric symptoms, functional and cognitive decline, although studies remain cross-sectional. Neither sertraline nor a carer intervention were effective in reducing symptoms. / Conclusion: This review finds that MinD is prevalent in people with a diagnosis of AD and requires clinical attention. Research is warranted to develop effective interventions to treat and prevent these symptoms

Un model de formació continuada, reflexiu i participatiu

Els reptes que planteja avui la comprensió del món, posen en evidència que cal una alfabetització científica i didàctica dels i de les mestres d’educació infantil i primària. La nostra experiència en formació ens porta a afirmar que aquests grans reptes cal abordar-los des d’una perspectiva socioconstructivista de la formació. El model de formació que presentem pretén donar resposta a les necessitats del professorat, en relació als coneixements i a la didàctica de les ciències. Proposa aprofundir en la reflexió sobre la pròpia pràctica i sobre noves propostes metodològiques, a fi d’actualitzar i millorar les competències tecnocientífiques

Synchronization and Stability in Noisy Population Dynamics

We study the stability and synchronization of predator-prey populations subjected to noise. The system is described by patches of local populations coupled by migration and predation over a neighborhood. When a single patch is considered, random perturbations tend to destabilize the populations, leading to extinction. If the number of patches is small, stabilization in the presence of noise is maintained at the expense of synchronization. As the number of patches increases, both the stability and the synchrony among patches increase. However, a residual asynchrony, large compared with the noise amplitude, seems to persist even in the limit of infinite number of patches. Therefore, the mechanism of stabilization by asynchrony recently proposed by R. Abta et. al., combining noise, diffusion and nonlinearities, seems to be more general than first proposed.Comment: 3 pages, 3 figures. To appear in Phys. Rev.

Topology and Evolution of Technology Innovation Networks

The web of relations linking technological innovation can be fairly described in terms of patent citations. The resulting patent citation network provides a picture of the large-scale organization of innovations and its time evolution. Here we study the patterns of change of patents registered by the US Patent and Trademark Office (USPTO). We show that the scaling behavior exhibited by this network is consistent with a preferential attachment mechanism together with a Weibull-shaped aging term. Such attachment kernel is shared by scientific citation networks, thus indicating an universal type of mechanism linking ideas and designs and their evolution. The implications for evolutionary theory of innovation are discussed.Comment: 6 pages, 5 figures, submitted to Physical Review

Exploring the randomness of Directed Acyclic Networks

The feed-forward relationship naturally observed in time-dependent processes and in a diverse number of real systems -such as some food-webs and electronic and neural wiring- can be described in terms of so-called directed acyclic graphs (DAGs). An important ingredient of the analysis of such networks is a proper comparison of their observed architecture against an ensemble of randomized graphs, thereby quantifying the {\em randomness} of the real systems with respect to suitable null models. This approximation is particularly relevant when the finite size and/or large connectivity of real systems make inadequate a comparison with the predictions obtained from the so-called {\em configuration model}. In this paper we analyze four methods of DAG randomization as defined by the desired combination of topological invariants (directed and undirected degree sequence and component distributions) aimed to be preserved. A highly ordered DAG, called \textit{snake}-graph and a Erd\:os-R\'enyi DAG were used to validate the performance of the algorithms. Finally, three real case studies, namely, the \textit{C. elegans} cell lineage network, a PhD student-advisor network and the Milgram's citation network were analyzed using each randomization method. Results show how the interpretation of degree-degree relations in DAGs respect to their randomized ensembles depend on the topological invariants imposed. In general, real DAGs provide disordered values, lower than the expected by chance when the directedness of the links is not preserved in the randomization process. Conversely, if the direction of the links is conserved throughout the randomization process, disorder indicators are close to the obtained from the null-model ensemble, although some deviations are observed.Comment: 13 pages, 5 figures and 5 table